Parallel perfusion imaging processing using GPGPU
نویسندگان
چکیده
BACKGROUND AND PURPOSE The objective of brain perfusion quantification is to generate parametric maps of relevant hemodynamic quantities such as cerebral blood flow (CBF), cerebral blood volume (CBV) and mean transit time (MTT) that can be used in diagnosis of acute stroke. These calculations involve deconvolution operations that can be very computationally expensive when using local Arterial Input Functions (AIF). As time is vitally important in the case of acute stroke, reducing the analysis time will reduce the number of brain cells damaged and increase the potential for recovery. METHODS GPUs originated as graphics generation dedicated co-processors, but modern GPUs have evolved to become a more general processor capable of executing scientific computations. It provides a highly parallel computing environment due to its large number of computing cores and constitutes an affordable high performance computing method. In this paper, we will present the implementation of a deconvolution algorithm for brain perfusion quantification on GPGPU (General Purpose Graphics Processor Units) using the CUDA programming model. We present the serial and parallel implementations of such algorithms and the evaluation of the performance gains using GPUs. RESULTS Our method has gained a 5.56 and 3.75 speedup for CT and MR images respectively. CONCLUSIONS It seems that using GPGPU is a desirable approach in perfusion imaging analysis, which does not harm the quality of cerebral hemodynamic maps but delivers results faster than the traditional computation.
منابع مشابه
Acceleration of the Retinex algorithm for image restoration by GPGPU/CUDA
Retinex is an image restoration method that can restore the image’s original appearance. The Retinex algorithm utilizes a Gaussian blur convolution with large kernel size to compute the center/surround information. Then a log-domain processing between the original image and the center/surround information is performed pixel-wise. The final step of the Retinex algorithm is to normalize the resul...
متن کاملGPU Computing to Improve Game Engine Performance
Although the graphics processing unit (GPU) was originally designed to accelerate the image creation for output to display, today’s general purpose GPU (GPGPU) computing offers unprecedented performance by offloading computing-intensive portions of the application to the GPGPU, while running the remainder of the code on the central processing unit (CPU). The highly parallel structure of a many ...
متن کاملGenerating Binary Optimal Codes Using Heterogeneous Parallel Computing
Generation of optimal codes is a well known problem in coding theory. Many computational approaches exist in the literature for finding record breaking codes. However generating codes with long lengths n using serial algorithms is computationally very expensive, for example the worst case time complexity of a Greedy algorithm is O(n 4). In order to improve the efficiency of generating codes wit...
متن کاملGPGPU Based Parallelized Client-Server Framework for Providing High Performance Computation Support
Parallel data processing has become indispensable for processing applications involving huge data sets. This brings into focus the Graphics Processing Units (GPUs) which emphasize on many-core computing. With the advent of General Purpose GPUs (GPGPU), applications not directly associated with graphics operations can also harness the computation capabilities of GPUs. Hence, it would be benefici...
متن کاملParallelizing Genetic Algorithms with GPGPU
GPGPU has proved effective in speeding up many applications, notably those that exhibit “embarrassing” parallelism (vector and matrix arithmetic, graphics, image processing, etc.). Other applications have proved more challenging. In particular, little research has been published on GPGPU parallelization of genetic algorithms. Genetic algorithms are inherently sequential in nature, but there is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 108 شماره
صفحات -
تاریخ انتشار 2012